Non-locality and Communication Complexity

نویسندگان

  • Harry Buhrman
  • Richard Cleve
  • Serge Massar
  • Ronald de Wolf
چکیده

Quantum information processing is the emerging field that defines and realizes computing devices that make use of quantum mechanical principles, like the superposition principle, entanglement, and interference. Until recently the common notion of computing was based on classical mechanics, and did not take into account all the possibilities that physically-realizable computing devices offer in principle. The field gained momentum after Peter Shor developed an efficient algorithm for factoring numbers, demonstrating the potential computing powers that quantum computing devices can unleash. In this review we study the information counterpart of computing. It was realized early on by Holevo, that quantum bits, the quantum mechanical counterpart of classical bits, cannot be used for efficient transformation of information, in the sense that arbitrary k-bit messages can not be compressed into messages of k − 1 qubits. The abstract form of the distributed computing setting is called communication complexity. It studies the amount of information, in terms of bits or in our case qubits, that two spatially separated computing devices need to exchange in order to perform some computational task. Surprisingly, quantum mechanics can be used to obtain dramatic advantages for such tasks. We review the area of quantum communication complexity, and show how it connects the foundational physics questions regarding non-locality with those of communication complexity studied in theoretical computer science. The first examples exhibiting the advantage of the use of qubits in distributed information-processing tasks were based on non-locality tests. However, by now the field has produced strong and interesting quantum protocols and algorithms of its own that demonstrate that entanglement, although it cannot be used to replace communication, can be used to reduce the communication exponentially. In turn, these new advances yield a new outlook on the foundations of physics, and could even yield new proposals for experiments that test the foundations of physics. ∗CWI and University of Amsterdam. Partially supported by a Vici grant from the Netherlands Organization for Scientific Research (NWO), and by the European Commission under the Integrated Project Qubit Applications (QAP) funded by the IST directorate as Contract Number 015848. †Institute for Quantum Computing and School of Computer Science, University of Waterloo, and Perimeter Institute for Theoretical Physics. Partially supported by Canada’s NSERC, CIFAR, QuantumWorks, MITACS, and the U.S. ARO. ‡Laboratoire d’Information Quantique, CP 225, Université Libre de Bruxelles (U.L.B.), Boulevard du Triomphe, B-1050 Bruxelles, Belgium. Partially supported by the Interuniversity Attraction Poles Programme Belgian State Belgian Science Policy under grant IAP6-10 and by the EU project QAP contract 015848. §CWI Amsterdam. Partially supported by a Vidi grant from the Netherlands Organization for Scientific Research (NWO), and by the European Commission under the Integrated Project Qubit Applications (QAP) funded by the IST directorate as Contract Number 015848.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Experimental requirements for quantum communication complexity protocols

I present a simple two-party quantum communication complexity protocol with higher success rate than the best possible classical protocol for the same task. The quantum protocol is shown to be equivalent to a quantum non-locality test, except that it is not necessary to close the locality loophole. I derive bounds for the detector efficiency and background count rates necessary for an experimen...

متن کامل

Programming Telepathy: Implementing Quantum Non-Locality Games

Quantum pseudo-telepathy is an intriguing phenomenon which results from the application of quantum information theory to communication complexity. To demonstrate this phenomenon researchers in the field of quantum communication complexity devised a number of quantum non-locality games. The setting of these games is as follows: the players are separated so that no communication between them is p...

متن کامل

Can non-local correlations be discriminated in polynomial time?

In view of the importance of quantum non-locality in cryptography, quantum computation and communication complexity, it is crucial to decide whether a given correlation exhibits non-locality or not. In the light of a theorem by Pitowski, it is generally believed that this problem is computationally intractable. In this paper, we first prove that the Euclidean distance of given correlations from...

متن کامل

Optimally Resilient and Adaptively Secure Multi-Party Computation with Low Communication Locality

Secure multi-party computation (MPC) has been thoroughly studied over the past decades. The vast majority of works assume a full communication pattern: every party exchanges messages with all the network participants over a complete network of point-to-point channels. This can be problematic in modern large scale networks, where the number of parties can be of the order of millions, as for exam...

متن کامل

What Can Be Observed Locally? Round-Based Models for Quantum Distributed Computing

We consider the question of locality in distributed computing in the context of quantum information. Specifically, we focus on the round complexity of quantum distributed algorithms, with no bounds imposed on local computational power or on the bit size of messages. Linial’s LOCAL model of a distributed system is augmented through two types of quantum extensions: (1) initialization of the syste...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009